Quantum Versus Classical Simultaneity in Communication Complexity
نویسندگان
چکیده
منابع مشابه
Quantum versus classical simultaneity in communication complexity
We present a bipartite partial function c̃Eq-negT , whose communication complexity is O ( (logn) ) in the model of quantum simultaneous message passing (Q‖,pub) and Ω̃(√n) in the model of randomised simultaneous message passing (R‖,pub). In fact, our function has a poly-logarithmic protocol even in the (restricted) model of quantum simultaneous message passing without shared randomness (Q‖), thus...
متن کاملUnbounded-Error Classical and Quantum Communication Complexity
Since the seminal work of Paturi and Simon [26, FOCS’84 & JCSS’86], the unboundederror classical communication complexity of a Boolean function has been studied based on the arrangement of points and hyperplanes. Recently, [14, ICALP’07] found that the unboundederror quantum communication complexity in the one-way communication model can also be investigated using the arrangement, and showed th...
متن کاملExponential Quantum-Classical Gaps in Multiparty Nondeterministic Communication Complexity
There are three different types of nondeterminism in quantum communication: i) NQP-communication, ii) QMA-communication, and iii) QCMA-communication. In this paper we show that multiparty NQP-communication can be exponentially stronger than QCMA-communication. This also implies an exponential separation with respect to classical multiparty nondeterministic communication complexity. We argue tha...
متن کاملClassical Communication Cost in Distributed Quantum Information Processing—A generalization of Quantum Communication Complexity
We study the amount of classical communication needed for distributed quantum information processing. In particular, we introduce the concept of ”remote preparation” of a quantum state. Given an ensemble of states, Alice’s task is to help Bob in a distant laboratory to prepare a state of her choice. We find several examples of an ensemble with an entropy S where the remote preparation can be do...
متن کامل2 Classical Communication Complexity
Can quantum communication be more efficient than its classical counterpart? Holevo’s theorem rules out the possibility of communicating more than n bits of classical information by the transmission of n quantum bits—unless the two parties are entangled, in which case twice as many classical bits can be communicated but no more. In apparent contradiction, there are distributed computational task...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2918453